Topological Applications of Generic Huge Embeddings
نویسندگان
چکیده
منابع مشابه
Topological Applications of Generic Huge Embeddings
In the Foreman-Laver model obtained by huge cardinal collapse, for many , <P(Ni) implies Ofi^). There are a variety of set-theoretic and topological applications, in particular to paracompactness. The key tools are generic huge embeddings and preservation via k-centred forcing. We also formulate "potent axioms" à la Foreman which enable us to transfer from N» to all cardinals. One such axiom...
متن کاملChang’s Conjecture, generic elementary embeddings and inner models for huge cardinals
These lectures summarize and organize the material appearing in: Smoke and Mirrors: Combinatorial properties of small cardinals equiconsistent with huge cardinals. • Much of the early history of logic in general and model theory in particular was tied up with understanding the expressive power of first and second order logic (and their variants). • One distinguishing feature of first order logi...
متن کاملA Topological Test for Embeddings
A new test for embedding time series data from low-dimensional chaotic systems into threedimensional phase spaces is proposed. It is topological, depending on specific invariant structures within a data set, rather than statistical averages over the entire attractor. We illustrate this test by applying it to electrolytic data. Although it can only be used to test for threedimensional embeddings...
متن کاملUpward Topological Book Embeddings of DAGs
Let G be a directed acyclic graph. An upward (k, h)topological book embedding of G is an upward book embedding on k pages of a subdivision of G where every edge is replaced by a path having at most h+2 vertices. In this extended abstract it is shown that every DAG with n vertices admits an upward (d + 1, 2dlogd ne − 1)-topological book embedding, where d is any integer such that d ≥ 2. The resu...
متن کاملOn ρ-Constrained Upward Topological Book Embeddings
Giordano, Liotta and Whitesides [1] developed an algorithm that, given an embedded planar st-digraph and a topological numbering ρ of its vertices, computes in O(n) time a ρ-constrained upward topological book embedding with at most 2n−4 spine crossings per edge. The number of spine crossings per edge is asymptotically worst case optimal. In this poster, we present improved results with respect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1994
ISSN: 0002-9947
DOI: 10.2307/2154614